Pseudo-Random Number Generators for Vector Processors and Multicore Processors
نویسندگان
چکیده
منابع مشابه
Pseudo-Random Number Generators for Vector Processors and Multicore Processors
There is a lack of good pseudo-random number generators capable of utilizing the vector processing capabilities and multiprocessing capabilities of modern computers. A suitable generator must have a feedback path long enough to fit the vector length or permit multiple instances with different parameter sets. The risk that multiple random streams from identical generators have overlapping subseq...
متن کاملFast Normal Random Number Generators for Vector Processors
We consider pseudo-random number generators suitable for vector processors. In particular, we describe vectorised implementations of the Box-Muller and Polar methods, and show that they give good performance on the Fujitsu VP2200. We also consider some other popular methods, e.g. the Ratio method and the method of Von Neumann and Forsythe, and show why they are unlikely to be competitive with t...
متن کاملFast normal random number generators on vector processors
We consider pseudo-random number generators suitable for vector processors. In particular, we describe vectorised implementations of the Box-Muller and Polar methods, and show that they give good performance on the Fujitsu VP2200. We also consider some other popular methods, e.g. the Ratio method and the method of Von Neumann and Forsythe, and show why they are unlikely to be competitive with t...
متن کاملPseudo-Random Number Generators
The first option here is not easy. Some pieces of data of this kind exist, for example from the decay of radioactive elements, but generally generation is slow and you cannot get the quantity of random numbers you require for modern applications. The second option here is what I’ll talk about today. Algorithms of this type are called “PseudoRandom Number Generators” (PRNGs). Many bad algorithms...
متن کاملPaging for Multicore Processors
Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim [16] studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily delaying request sequences to its adva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Applied Statistical Methods
سال: 2015
ISSN: 1538-9472
DOI: 10.22237/jmasm/1430454120